Probabilistic Completeness of the Belief Space Motion Planners
نویسندگان
چکیده
This paper extends the concept of “probabilistic completeness” defined for the motion planners in the state space (or configuration space) to the concept of “probabilistic completeness under uncertainty” for the motion planners in the belief space. Accordingly, an approach is proposed to verify the probabilistic completeness of the sampling-based planners in the belief space. Finally, through the proposed approach, it is shown that under mild conditions the samplingbased method constructed based on the abstract framework of FIRM (Feedback-based Information Roadmap Method) are probabilistically complete under uncertainty.
منابع مشابه
On the Probabilistic Completeness of the Sampling-based Motion Planning Methods Under Uncertainty
This paper extends the concept of probabilistic completeness defined for the motion planners in the absence of noise, to the concept of “probabilistic completeness under uncertainty” for the motion planners that perform planning in the presence of uncertainty. According to the proposed definition, an approach is proposed to verify the probabilistic completeness under uncertainty. Finally, it is...
متن کاملCompleteness in Probabilistic Metric Spaces
The idea of probabilistic metric space was introduced by Menger and he showed that probabilistic metric spaces are generalizations of metric spaces. Thus, in this paper, we prove some of the important features and theorems and conclusions that are found in metric spaces. At the beginning of this paper, the distance distribution functions are proposed. These functions are essential in defining p...
متن کاملDynamic Feedback Linearization-based Belief Stabilization for Nonholonomic Motion Planning in Belief Space
In roadmap-based methods, such as the Probabilistic Roadmap Method (PRM) in deterministic environments or the Feedbackbased Information RoadMap (FIRM) in partially observable probabilistic environments, a stabilizing controller is needed to guarantee node reachability in state or belief space. In belief space, it has been shown that the belief-node reachability can be achieved using stationary ...
متن کاملOn Probabilistic Completeness and Expected Complexity of Probabilistic Path Planning
The probabilistic path planner (PPP) is a general planning scheme that yields fast robot path planners for a wide variety of problems, involving, e.g., high degree of freedom articulated robots, nonholonomic robots, and multiple robots. In this paper we go into theoretical aspects regarding the behaviour of PPP. We formulate general properties that guarantee probabilistic completeness of PPP, a...
متن کاملReachability-based analysis for Probabilistic Roadmap planners
In the last fifteen years, sampling-based planners like the Probabilistic Roadmap Method (PRM) have proved to be successful in solving complex motion planning problems. While theoretically, the complexity of the motion planning problem is exponential in the number of degrees of freedom, sampling-based planners can successfully handle this curse of dimensionality in practice. We give a reachabil...
متن کامل